Skew compressions of positive definite operators and matrices
نویسندگان
چکیده
منابع مشابه
Some Extremal Problems for Positive Definite Matrices and Operators
Let C be a real-valued function defined on the set 9& of all positive definite complex hermitian or real symmetric matrices according as F = C (the complex field) or F = R (the real field). Suppose A, B E 9&. We study the optimization problems of (1) finding max C(X) subject to A X, B X positive semidefinite, (2) finding minG(X) subject to X A, X B positive semidefinite. For a general class of ...
متن کاملON f-CONNECTIONS OF POSITIVE DEFINITE MATRICES
In this paper, by using Mond-Pečarić method we provide some inequalities for connections of positive definite matrices. Next, we discuss specifications of the obtained results for some special cases. In doing so, we use α-arithmetic, α-geometric and α-harmonic operator means.
متن کاملProduct of three positive semi-definite matrices
In [2], the author showed that a square matrix with nonnegative determinant can always be written as the product of five or fewer positive semi-definite matrices. This is an extension to the result in [1] asserting that every matrix with positive determinant is the product of five or fewer positive definite matrices. Analogous to the analysis in [1], the author of [2] studied those matrices whi...
متن کاملWasserstein Riemannian Geometry of Positive-definite Matrices∗
The Wasserstein distance on multivariate non-degenerate Gaussian densities is a Riemannian distance. After reviewing the properties of the distance and the metric geodesic, we derive an explicit form of the Riemannian metrics on positive-definite matrices and compute its tensor form with respect to the trace scalar product. The tensor is a matrix, which is the solution of a Lyapunov equation. W...
متن کاملRiemannian Sparse Coding for Positive Definite Matrices
Inspired by the great success of sparse coding for vector valued data, our goal is to represent symmetric positive definite (SPD) data matrices as sparse linear combinations of atoms from a dictionary, where each atom itself is an SPD matrix. Since SPD matrices follow a non-Euclidean (in fact a Riemannian) geometry, existing sparse coding techniques for Euclidean data cannot be directly extende...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2020
ISSN: 1081-3810
DOI: 10.13001/ela.2020.5335